Walking an Unknown Street with Bounded Detour

نویسنده

  • Rolf Klein
چکیده

A polygon with two distinguished vertices, s and g, is called a street iff the two boundary chains from s t o g are mutually weakly visible. For a mobile robot with on-board vision system we describe a strategy for finding a short path from s t o g in a street not known in advance, and prove that the length of the path created does not exceed 1 + 2. times the length of the shortest path from s to g . Experiments suggest that our strategy is much better than this, as no ratio bigger than 1.8 has yet been observed. This is complemented b y a lower bound of 1.41 for the relative detour each strategy can be forced t o generate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Way to Go: Identifying Routes for Walkers and Cyclists to Avoid Air Pollutants

Exposures to air pollutants may offset a portion of the health benefits of walking and bicycling in cities. However, taking a detour just a block or two away from the busiest streets and roads “can make a big difference in your exposure,” says Steve Hankey, an assistant professor at Virginia Polytechnic Institute and State University and coauthor of a new study in EHP. For every street block in...

متن کامل

Detour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel

A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path  $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A  detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex  of at most on...

متن کامل

Walking in Streets with Minimal Sensing

We consider the problem of walking a robot in an unknown polygon called “street”, starting from a point s to reach a target t . The robot is assumed to have minimal sensing capability in a way that cannot infer any geometric properties of the environment, such as its coordinates, angles or distances; but it is equipped with a sensor that can only detect the discontinuities in the depth informat...

متن کامل

DIRECT ADAPTIVE FUZZY PI SLIDING MODE CONTROL OF SYSTEMS WITH UNKNOWN BUT BOUNDED DISTURBANCES

An asymptotically stable direct adaptive fuzzy PI sliding modecontroller is proposed for a class of nonlinear uncertain systems. In contrast toother existing approaches of handling disturbances, the proposed approachdoes not require this bound to be known, only requiring that it exists.Moreover, a PI control structure is used to attenuate chattering. The approachis applied to stabilize an open-...

متن کامل

A Competitive Strategy for Walking in Generalized Streets for a Simple Robot

In this study, we consider the problem of walking in an unknown generalized street or G-street, for a simple robot. The basic robot is equipped with a sensor that only detect the discontinuities in depth information (gaps). In the former recent researches some competitive strategies for walking the robot in street polygons have been presented. In this research we have empowered the robot by add...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1991